On Cryptographic Propagation Criteria for Boolean Functions
نویسندگان
چکیده
منابع مشابه
Cryptographic Criteria on Vector Boolean Functions
Most modern block and stream ciphers can be expressed as certain arrangement of Vector Boolean Functions. Thus, in the context of block and stream ciphers’ design (mainly in S-boxes and combining functions respectively), it is essential to define criteria which measure the cryptographic strength of Boolean Functions and Vector Boolean Functions. Ideally, some of the following requirements must ...
متن کاملAperiodic propagation criteria for Boolean functions
We characterise the aperiodic autocorrelation for a Boolean function, f , and define the Aperiodic Propagation Criteria (APC) of degree l and order q. We establish the strong similarity between APC and the Extended Propagation Criteria (EPC) as defined by Preneel et al. in 1991, although the criteria are not identical. We also show how aperiodic autocorrelation can be related to the first deriv...
متن کاملBoolean Functions Satisfying Higher Order Propagation Criteria
Boolean functions that satisfy higher order propagation criteria are studied. A complete characterization is given of the autocorrelation function and Walsh spectrum of second order functions. The number of second order functions satisfying PC(k) is related to a problem in coding theory and can be computed explicitly for k = 1, n− 1 and n. A new interpretation of the number of balanced second o...
متن کاملCryptographic Boolean functions: One output, many design criteria
Boolean functions represent an important primitive in the design of various cryptographic algorithms. There exist several well-known schemes where a Boolean functions is used to add nonlinearity to the cipher. Thus, methods to generate Boolean functions that possess good cryptographic properties is an important research goal. Among other techniques, evolutionary computation has proved to be a w...
متن کاملNew balanced Boolean functions satisfying all the main cryptographic criteria
We study an infinite class of functions which provably achieve an optimum algebraic immunity, an optimum algebraic degree and a good nonlinearity. We checked that it has also a good behavior against fast algebraic attacks.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1999
ISSN: 0890-5401
DOI: 10.1006/inco.1998.2763